Approximate Minimization Of Generalized Reed Muller Forms

نویسندگان

  • Xiaoqiang Zeng
  • Marek Perkowski
  • Karen Dill
  • Andisheh Sarabi
چکیده

Paper presents a new approach to Gen eralized Reed Muller form minimization The concept of adjacent polarity of forms is introduced that is next used to generate exact and approximate solutions An algorithm to generate a GRM form from any other form is given While adjacent polarities are used for local optimization global minimum is found using the adaptation of Genetic Algorithm approach For the rst time the problem has been solved for multiple output incompletely speci ed functions

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Canonical And/exor Form That Includes Both the Generalized Reed-muller Forms and Kronecker Reed-muller Forms

| The paper gives a positive answer to a question posed by Tsutomu Sasao-whether there exists some family of canonical forms that would include both the Generalized Reed-Muller Forms and the Kro-necker RM Forms as its special cases. We call the new forms Generalized Kronecker Forms. We present also the corresponding decision diagrams. They can be used for representation of large functions and a...

متن کامل

Boolean Matching Using Generalized Reed-Muller Forms

In this paper we present a new method for Boolean matching of completely specified Boolean functions. The canonical Generalized Reed-Muller forms are used as a powerful analysis tool. Input permutation, input and output negation for matching are handled simultaneously. To reduce the search space for input correspondence, we have developed a method that can detect symmetries of any number of inp...

متن کامل

A Canonical And/exor Form That Includes Both the Generalized Reed-muller Forms and Kronecker Forms

| The paper gives a positive answer to an open problem-whether there exists some family of canonical forms that would include both the Generalized Reed-Muller Forms and the Kronecker Forms as its special cases. We call the new forms Generalized Kronecker Forms. We present also the corresponding decision diagrams. They can be used for representation of large functions and also for optimal synthe...

متن کامل

A New Exact Algorithm for Highly Testable Generalized Partially Mixed Polarity Reed Muller Forms

Generalized Partially Mixed Polarity Reed Muller GPMPRM expansions are a canonical sub family of Generalized Reed Muller GRM expansions and super family of Fixed Polarity Reed Muller FPRM expansions The main motivation to study GPM PRM forms is their very high testability similar to FPRM forms and better than GRMs which are also highly testable Since GPMPRM sub family of ESOP is much larger tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006